is.\*:("0988-3754")
Results 1 to 25 of 630
Selection :
SOME PROBLEMS IN AUTOMATA THEORY WHICH DEPEND ON THE MODELS OF SET THEORYFINKEL, Olivier.Informatique théorique et applications (Imprimé). 2011, Vol 45, Num 4, pp 383-397, issn 0988-3754, 15 p.Article
CORRIGENDUM TO OUR PAPER: HOW EXPRESSIONS CAN CODE FOR AUTOMATALOMBARDY, Sylvain; SAKAROVITCH, Jacques.Informatique théorique et applications (Imprimé). 2010, Vol 44, Num 3, pp 339-361, issn 0988-3754, 23 p.Article
EXTENDING REGULAR EXPRESSIONS WITH HOMOMORPHIC REPLACEMENTBORDIHN, Henning; DASSOW, Jürgen; HOLZER, Markus et al.Informatique théorique et applications (Imprimé). 2010, Vol 44, Num 2, pp 229-255, issn 0988-3754, 27 p.Article
STURMIAN JUNGLE (OR GARDEN?) ON MULTILITERAL ALPHABETSBALKOVA, L'ubomíra; PELANTOVA, Edita; STAROSTA, Stěpán et al.Informatique théorique et applications (Imprimé). 2010, Vol 44, Num 4, pp 443-470, issn 0988-3754, 28 p.Article
A MORPHIC APPROACH TO COMBINATORIAL GAMES : THE TRIBONACCI CASEDUCHENE, Eric; RIGO, Michel.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 2, pp 375-393, issn 0988-3754, 19 p.Article
DECIDING WHETHER A RELATION DEFINED IN PRESBURGER LOGIC CAN BE DEFINED IN WEAKER LOGICSCHOFFRUT, Christian.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 1, pp 121-135, issn 0988-3754, 15 p.Article
LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURESBESOMBES, Jérome; MARION, Jean-Yves.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 1, pp 165-182, issn 0988-3754, 18 p.Article
STATE COMPLEXITY OF CYCLIC SHIFTJIRASKOVA, Galina; OKHOTIN, Alexander.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 2, pp 335-360, issn 0988-3754, 26 p.Article
A NOTE ON UNIVOQUE SELF-STURMIAN NUMBERSALLOUCHE, Jean-Paul.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 4, pp 659-662, issn 0988-3754, 4 p.Article
A HIERARCHY FOR CIRCULAR CODESPIRILLO, Giuseppe.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 4, pp 717-728, issn 0988-3754, 12 p.Article
SOME ALGEBRAIC PROPERTIES OF MACHINE POSET OF INFINITE WORDSBELOVS, Aleksandrs.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 3, pp 451-466, issn 0988-3754, 16 p.Conference Paper
TWO SIDED SAND PILES MODEL AND UNIMODAL SEQUENCESTHI HA DUONG PHAN.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 3, pp 631-646, issn 0988-3754, 16 p.Conference Paper
Decidability of code propertiesFERNAU, Henning; REINHARDT, Klaus; STAIGER, Ludwig et al.Informatique théorique et applications (Imprimé). 2007, Vol 41, Num 3, pp 243-259, issn 0988-3754, 17 p.Article
LEARNING TREE LANGUAGES FROM TEXTFERNAU, Henning.Informatique théorique et applications (Imprimé). 2007, Vol 41, Num 4, pp 351-374, issn 0988-3754, 24 p.Article
UNIFORMLY BOUNDED DUPLICATION CODESLEUPOLD, Peter; MITRANA, Victor.Informatique théorique et applications (Imprimé). 2007, Vol 41, Num 4, pp 411-424, issn 0988-3754, 14 p.Article
Correct rounding of algebraic functionsBRISEBARRE, Nicolas; MULLER, Jean-Michel.Informatique théorique et applications (Imprimé). 2007, Vol 41, Num 1, pp 71-83, issn 0988-3754, 13 p.Article
Characterization of lung tumor subtypes through gene expression cluster validity assessmentVALENTINI, Giorgio; RUFFINO, Francesca.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 163-176, issn 0988-3754, 14 p.Article
Different time solutions for the Firing Squad Synchronization Problem on basic grid networksGRUSKA, Jozef; LA TORRE, Salvatore; NAPOLI, Margherita et al.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 177-206, issn 0988-3754, 30 p.Article
Edit distance between unlabeled ordered treesMICHELI, Anne; ROSSTN, Dominique.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 4, pp 593-609, issn 0988-3754, 17 p.Article
Entropy generation in a model of reversible computationDE FALCO, Diego; TAMASCELLI, Dario.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 93-105, issn 0988-3754, 13 p.Article
On a complete set of operations for factorizing codesDE FELICE, Clelia.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 1, pp 29-52, issn 0988-3754, 24 p.Article
On multiperiodic wordsHOLUB, Stepan.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 4, pp 583-591, issn 0988-3754, 9 p.Article
Quantum finite automata with control languageMEREGHETTI, Carlo; PALANO, Beatrice.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 315-332, issn 0988-3754, 18 p.Article
Sequences of low arithmetical complexityAVGUSTINOVICH, Sergey V; CASSAIGNE, Julien; FRID, Anna E et al.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 4, pp 569-582, issn 0988-3754, 14 p.Article
Solving maximum independent set by asynchronous distributed hopfield-type neural networksGROSSI, Giuliano; MARCHI, Massimo; POSENATO, Roberto et al.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 371-388, issn 0988-3754, 18 p.Article